A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra

نویسندگان

  • João Fernando Ferreira
  • Alexandra Mendes
چکیده

This paper proposes a calculational approach to prove properties of two well-known binary trees used to enumerate the rational numbers: the Stern-Brocot tree and the Eisenstein-Stern tree (also known as CalkinWilf tree). The calculational style of reasoning is enabled by a matrix formulation that is well-suited to naturally formulate path-based properties, since it provides a natural way to refer to paths in the trees. Three new properties are presented. First, we show that nodes with palindromic paths contain the same rational in both the Stern-Brocot and Eisenstein-Stern trees. Second, we show how certain numerators and denominators in these trees can be written as the sum of two squares x and y, with the rational xy appearing in specific paths. Finally, we show how we can construct Sierpiński’s triangle from these trees of rationals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paths on Stern-Brocot Tree and Winding numbers of modes

The aim of this paper is to propose a natural definition of a winding number for a m-note mode, generalizing the concept of well formedness (proposed by Carey and Clampitt) providing and discussing some aspects regarding the Stern-Brocot trees. We start by giving an algebraic definition of a m-notes mode in a chromatic set of n elements as a composed map between Zm and Zn. Then we introduce the...

متن کامل

An arborist’s guide to the rationals

There are two well-known ways to enumerate the positive rational numbers in an infinite binary tree: the Farey/Stern-Brocot tree and the Calkin-Wilf tree. In this brief note, we describe these two trees as ‘transpose shadows’ of a tree of matrices (a result due to Backhouse and Ferreira) via a new proof using yet another famous tree of rationals: the topograph of Conway and Fung.

متن کامل

Linking the Calkin-Wilf and Stern-Brocot trees

Links between the Calkin-Wilif tree and the Stern-Brocot tree are discussed answering the questions: What is the jth vertex in the nth level of the Calkin-Wilf tree? A simple mechanism is described for converting the jth vertex in the nth level of the Calkin-Wilf tree into the jth entry in the nth level of the Stern-Brocot tree. We also provide a simple method for evaluating terms in the hyperb...

متن کامل

The Moments of Minkowski Question Mark Function: the Dyadic Period Function

The Minkowski question mark function ?(x) arises as a real distribution of rationals in the Farey tree. We examine the generating function of moments of ?(x). It appears that the generating function is a direct dyadic analogue of period functions for Maass wave forms and it is defined in the cut planeC\(0,∞). The exponential generating function satisfies the integral equation with kernel being ...

متن کامل

Admissible Digit Sets and a Modified Stern–Brocot Representation

We examine a special case of admissible representations of the closed interval, namely those which arise via sequences of a finite number of Möbius transformations. We regard certain sets of Möbius transformations as a generalized notion of digits and introduce sufficient conditions that such a “digit set” yields an admissible representation of [0,+∞]. Furthermore we establish the productivity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Log. Algebr. Meth. Program.

دوره 85  شماره 

صفحات  -

تاریخ انتشار 2016